Approximate cover of strings
نویسندگان
چکیده
منابع مشابه
Approximate Cover of Strings
Regularities in strings arise in various areas of science, including coding and automata theory, formal language theory, combinatorics, molecular biology and many others. A common notion to describe regularity in a string T is a cover, which is a string C for which every letter of T lies within some occurrence of C. The alignment of the cover repetitions in the given text is called a tiling. In...
متن کاملApproximate Seeds of Strings
In this paper we study approximate seeds of strings, that is, substrings of a given string x that cover (by concatenations or overlaps) a superstring of x, under a variety of distance rules (the Hamming distance, the edit distance, and the weighted edit distance). We solve the smallest distance approximate seed problem and the restricted smallest approximate seed problem in polynomial time and ...
متن کاملApproximate Periods of Strings
The study of approximately periodic strings is relevant to diverse applications such as molecular biology data compression and computer assisted music analysis Here we study di erent forms of ap proximate periodicity under a variety of distance rules We consider three related problems for two of which we derive polynomial time algorithms we then show that the third problem is NP complete
متن کاملApproximate Periodicity in Strings
In many application areas (for instance, DNA sequence analysis), it becomes important to compute various kinds of \approximate period" of a given string y. Here we discuss three such approximate periods and the algorithms which compute them: an Abelian generator, a cover, and a seed. Let u be a substring of y. Then u is an Abelian generator of y ii y is a concatenation of substrings which are p...
متن کاملApproximate Seeds of Strings 1
In this paper we study approximate seeds of strings, that is, substrings of a given string x that cover (by concatenations or overlaps) a superstring of x, under a variety of distance rules (the Hamming distance, the edit distance, and the weighted edit distance). We solve the smallest distance approximate seed problem and the restricted smallest approximate seed problem in polynomial time and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2019
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2019.05.020